-approximation for two-machine no-wait flowshop scheduling with availability constraints
نویسندگان
چکیده
منابع مشابه
3/2-approximation for Two-machine No-wait Flowshop Scheduling with Availability Constraints
We consider in this paper the two-machine no-wait flowshop problem in which each machine may have an unavailable interval. We present 3 2 -approximation algorithms for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. These algorithms improve on existing results.
متن کاملApproximability of two-machine no-wait flowshop scheduling with availability constraints
We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap.
متن کاملApproximation Algorithms for the Two-Machine Flow Shop No-Wait Scheduling with a Non-Availability Interval
We study the two-machine flow shop scheduling problem with no-wait in process, in which one of the machines is not available during a given time interval. The objective is to minimize the makespan. The problem is known to be NP-hard, and in the case of several non-availability intervals is not approximable within a constant factor. We consider all possible scenarios of handling the operation af...
متن کاملHeuristic algorithms for two-machine flowshop with availability constraints
The majority of the scheduling studies carry a common assumption that machines are available all the time. However, machines may not always be available in the scheduling period due to breakdown or preventive maintenance. Taking preventive maintenance activity into consideration, we dealt with the twomachine flowshop scheduling problem with makespan objective. The preventive maintenance policy ...
متن کاملAn approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme (PTAS) for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2003
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2003.08.002